x

Djikstra's Algorithm

It is an algorithm for finding the shortest paths between nodes in a weighted graph.

Such a graph may represent physical entities such as road networks

Left-click: follow link, Right-click: select node, Scroll: zoom
x